Thesis Proposal Responsive Parallel Computation
نویسندگان
چکیده
Multicore processors are becoming increasingly prevalent, blurring the lines between traditional parallel programs, which use cooperative threading to reduce execution time, and interactive programs which use competitive threading to increase responsiveness. To assist programmers in developing this new class of responsive parallel programs which use threads for both of these purposes, I propose a model that combines the cooperative and competitive paradigms. The proposed model spans many levels of abstraction. The first component is a cost model that extends existing models of cooperative threading in order to allow programmers to reason about the parallel running time and the responsiveness of responsive parallel applications. The second is a language that neatly combines abstractions for both forms of threading, and enables reasoning about efficiency and responsiveness at the level of the source code. Finally, I propose to implement the language as part of a compiler for Standard ML, and evaluate it on a benchmark suite including a number of realistic responsive parallel applications.
منابع مشابه
Thesis Proposal Parallel Learning and Inference in Probabilistic Graphical Models
Probabilistic graphical models are one of the most influential and widely used techniques in machine learning. Powered by exponential gains in processor technology, graphical models have been successfully applied to a wide range of increasingly large and complex real-world problems. However, recent developments in computer architecture, large-scale computing, and data-storage have shifted the f...
متن کاملOn the parallel computation thesis
We develop a generic programming language for parallel algorithms, one that works for all data structures and control structures. We show that any parallel algorithm satisfying intuitively-appealing postulates can be modeled by a collection of cells, each of which is an abstract state machine, augmented with the ability to spawn new cells. The cells all run the same algorithm and communicate vi...
متن کاملTime-Space Trade-Offs in Parallel and Neural Computing
To which extend can we speak about time-space tradeoffs in the sense that, for a given problem, a faster algorithm requires more space than a slower algorithm? Furthermore, to which extend can we speak about such trade-offs in the context of parallel or neural computing? This paper aims to give an insight to these problems. The parallel computation thesis, first proposed in print in [Ch.S.76], ...
متن کامل